Evaluation of Efficiency of New Combined Pso-eo Algorithm in Solving Sailor Assignment Problem

The sailor assignment problem is a classic example of the generalized task assignment problem. In this instance, it is tried to assign the optimum tasks to the sailors in various time intervals according to their skills, experience and their location with different workloads. This problem has numerous applications in real world however due to many constraints and targets; the solution is not straightforward and requires intelligent algorithms. There are a few previous studies in on this problem that typically have used Genetic Algorithm and its Multi-objectives methods. In this study, we are using a powerful combined PSO-EO method to solve this complicated problem. In this method, the discovery ability of PSO along with extraction ability of EO is combined to find the optimum Pareto front of this complicated problem in the least possible time. To evaluate the efficiency of e proposed method, Pareto front, execution time, frequency of diversity of the samples and extent of search coverage have compared with those of NSGAII algorithm and Kuhn-Munkres base algorithm. This comparison confirms the efficiency of the proposed method.